Flexible Traceable Generic Genetic Algorithm

This document elaborates on the generic implementation one of main heuristics algorithms verified through its quick application to a biology problem requiring find out an optimal sequences tree topology. In order solve this problem, categorized as Non-Polynomial Hard (NP-Hard), “to minimize differences between given (leaf) and/or derived (parent) sequences”, many popular methods are used. “The higher number is, more advisable and efficient it would be go towards they provide close-enough solution faster, for instance genetic amongst others do. Thus, part larger research in Heuristics phylogenies, paper aims suggest advanced flexible Genetic Algorithm by “general way encode into instances different heuristic algorithms” mentioned our first reference below. The proposed algorithm will also present chronology traceability feature further analysis potential improvements.